data - driven controller tuning using the correlation approach

The essential ingredients of control design procedures include the acquisition of process knowledge and its efficient integration into the controller. In many practical control applications, a reliable mathematical description of the plant is difficult or impossible to obtain, and the controller has to be designed on the basis of measurements. This thesis proposes a new datadriven method labeled Correlation-based Tuning (CbT). The underlying idea is inspired by the well-known correlation approach in system identification. The controller parameters are tuned iteratively either to decorrelate the closed-loop output error between designed and achieved closed-loop systems with the external reference signal (decorrelation procedure) or to reduce this correlation (correlation reduction). Ideally, the resulting closedloop output error contains only the contribution of the noise and perfect model-following can be achieved. By the very nature of the control design criterion, the controller parameters are asymptotically insensitive to noise. Both theoretical and implementation aspects of CbT are treated. For the decorrelation procedure, a correlation equation is solved using the stochastic approximation method. The iterative procedure converges to the solution of the correlation equation even in the case when an approximate gradient of the closed-loop output error with respect to controller parameters is used. The asymptotic distribution of the resulting controller parameter estimates is analyzed. When perfect decorrelation is not possible, the correlation reduction method can be used. That is, instead of solving the correlation equation, the norm of a cross-correlation function is minimized. A frequency domain analysis of the criterion shows that the algorithm minimizes the two-norm of the difference between the achieved and designed closed-loop systems.With the correlation reduction method, an unbiased estimate of the gradient of the closed-loop output error is necessary to guarantee convergence of the algorithm to a local minimum of the criterion. Furthermore,